Search results for "Pumping lemma for context-free languages"

showing 2 items of 2 documents

Cancellation, pumping and permutation in formal languages

1984

Formal grammarTheoretical computer scienceChomsky hierarchyFormal languageContext-free languageAbstract family of languagesPumping lemma for context-free languagesArithmeticCone (formal languages)Pumping lemma for regular languagesMathematics
researchProduct

On block pumpable languages

2016

Ehrenfeucht, Parikh and Rozenberg gave an interesting characterisation of the regular languages called the block pumping property. When requiring this property only with respect to members of the language but not with respect to nonmembers, one gets the notion of block pumpable languages. It is shown that these block pumpable are a more general concept than regular languages and that they are an interesting notion of their own: they are closed under intersection, union and homomorphism by transducers; they admit multiple pumping; they have either polynomial or exponential growth.

Discrete mathematicsGeneral Computer ScienceAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technology01 natural sciencesCone (formal languages)Pumping lemma for regular languagesTheoretical Computer ScienceCombinatoricsRegular languageIntersection010201 computation theory & mathematicsBlock (programming)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingHomomorphismPumping lemma for context-free languagesComputer Science::Formal Languages and Automata TheoryMathematicsTheoretical Computer Science
researchProduct